Some results in support of the Kakeya Conjecture

نویسندگان

  • Jonathan M. Fraser
  • Eric J. Olson
  • James C. Robinson
چکیده

A Kakeya set is a subset of R that contains a unit line segment in every direction. We introduce a technique called ‘cut-and-move’ designed to study Kakeya sets and use this to make several simple observations in support of the famous Kakeya conjecture. For example, we give a very simple proof that the lower box-counting dimension of any Kakeya set is at least d/2. We also examine the generic validity of the Kakeya conjecture in the following sense. Let S̊d−1 denote the unit sphere in R with antipodal points identified. We encode a Kakeya set in R as a bounded map f : S̊d−1 → R, where f(x) gives the centre of the unit line segment orientated in the x direction. Denoting by B(S̊d−1) the collection of all such maps equipped with the supremum norm, we show that (i) for a dense set of f the corresponding Kakeya set has positive Lebesgue measure and (ii) the set of those f for which the corresponding Kakeya set has maximal upper box-counting (Minkowski) dimension d is a residual subset of B(S̊d−1). Mathematics Subject Classification 2010: 28A80, 54E52, 28A75.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on the Kakeya Maximal Conjecture and Related Problems

We discuss the relation between the restriction conjecture, the Kakeya maximal conjecture and the Kakeya conjecture. We follow [4] and [5] very closely.

متن کامل

Finite field Kakeya and Nikodym sets in three dimensions

We give improved lower bounds on the size of Kakeya and Nikodym sets over Fq. We also propose a natural conjecture on the minimum number of points in the union of a not-too-flat set of lines in Fq, and show that this conjecture implies an optimal bound on the size of a Nikodym set. Finally, we study the notion of a weak Nikodym set and give improved, and in some special cases optimal, bounds fo...

متن کامل

The Finite Field Kakeya Conjecture

In this paper we introduce the celebrated Kakeya Conjecture in the original real case setting and discuss the proof of its finite field analogue. The story begins in 1917 when, with the hope of figuring out a mathematical formalization of the movement of a samurai during battle, Sochi Kakeya proposed the following problem: What is the least area in the plane required to continuously rotate a ne...

متن کامل

The Endpoint Case of the Bennett-carbery-tao Multilinear Kakeya Conjecture

We prove the endpoint case of the multilinear Kakeya conjecture of Bennett, Carbery, and Tao. The proof uses the polynomial method introduced by Dvir. In [1], Bennett, Carbery, and Tao formulated a multilinear Kakeya conjecture, and they proved the conjecture except for the endpoint case. In this paper, we slightly sharpen their result by proving the endpoint case of the conjecture. Our method ...

متن کامل

Some difference results on Hayman conjecture and uniqueness

In this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite Picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on Hayman conjecture. We also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016